Minimisation of empty runs in transport

Optimization of empty container movements in intermodal transport

On Runs in Independent Sequences

Given an i.i.d. sequence of n letters from a finite alphabet, we consider the length of the longest run of any letter. In the equiprobable case, results for this run turn out to be closely related to the well-known results for the longest run of a given letter. For coin-tossing, tail probabilities are compared for both kinds of runs via Poisson approximation.

The importance of Midwife Runs Primary Units in Iran

This article has no abstract.  

Prevalence of empty sella syndrome

Background: The empty sella syndrome (ESS) is a neurological or pathologic finding in which sella turcica is devoid of pituitary tissue and the subarachnoid space extends into sella turcica, which is either primary or secondary as well as partial and complete. The widespread use of CT scans and MRIs today has made the ESS a common finding in imaging. The aim of this study was to evaluate the pr...

When Short Runs Beat Long Runs

What will yield the best results: doing one run n generations long or doing m runs n/m generations long each? This paper presents a techniqueindependent analysis which answers this question, and has direct applicability to scheduling and restart theory in evolutionary computation and other stochastic methods. The paper then applies this technique to three problem domains in genetic programming....